RAINBOW CONNECTION PADA GRAF k -CONNECTED UNTUK k = 1 ATAU 2
نویسندگان
چکیده
منابع مشابه
Total rainbow k-connection in graphs
Let k be a positive integer and G be a k-connected graph. In 2009, Chartrand, Johns, McKeon, and Zhang introduced the rainbow k-connection number rck(G) of G. An edge-coloured path is rainbow if its edges have distinct colours. Then, rck(G) is the minimum number of colours required to colour the edges of G so that any two vertices of G are connected by k internally vertex-disjoint rainbow paths...
متن کاملRainbow k-connection in Dense Graphs
An edge-coloured path is rainbow if the colours of its edges are distinct. For a positive integer k, an edge-colouring of a graph G is rainbow k-connected if any two vertices of G are connected by k internally vertex-disjoint rainbow paths. The rainbow k-connection number rck(G) is defined to be the minimum integer t such that there exists an edge-colouring of G with t colours which is rainbow ...
متن کاملOn minimally rainbow k-connected graphs
An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. A graph G is called rainbow k-connected, if there is an edge-colouring of G with k colours such that G is rainbow-connected. In this talk we will study rainbow k-connected graphs with a minimum number of edges. For an integer n ≥ 3 and 1 ≤ k ≤ n − 1 let t(n, k) denote the...
متن کاملMinimally (k, k-1)-edge-connected graphs
For an interger l > 1, the l-edge-connectivity λl(G) of G is defined to be the smallest number of edges whose removal leaves a graph with at least l components, if |V (G)| ≥ l; and λl(G) = |V (G)| if |V (G)| ≤ l. A graph G is (k, l)-edge-connected if the l-edge-connectivity of G is at least k. A sufficient and necessary condition for G to be minimally (k, k − 1)-edgeconnected is obtained in the...
متن کاملOn minimally rainbow k-connected graphs (15:30 Uhr)
An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. A graph G is called rainbow k-connected, if there is an edge-colouring of G with k colours such that G is rainbow-connected. In this talk we will study rainbow k-connected graphs with a minimum number of edges. For an integer n ≥ 3 and 1 ≤ k ≤ n− 1 let t(n, k) denote the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Matematika UNAND
سال: 2013
ISSN: 2721-9410,2303-291X
DOI: 10.25077/jmu.2.1.78-84.2013